/****************************************************************
 * Homework 5 'Scheduler' class implementation file
 * Author: Duncan Buell
 * Date last modified: 3 January 2010
 *
 * This class manages a priority queue of process blocks for
 * simulating process management in an operating system.
 * 
 * There are really only two nontrivial functions in this
 * class, one to add a process to the queue and one to dump
 * the entire queue into a string for debug printing.
 *
 * The other functions are simply pass-through functions for 
 * the 'empty', 'pop', and 'top' functions of the STL 
 * 'priority_queue' construct that is the main data object of
 * this class.
**/
#include "Scheduler.h"

static const char TAG[] = "Scheduler: ";

/****************************************************************
 * Constructor.
**/
Scheduler::Scheduler()
{
}

/****************************************************************
 * Destructor.
**/
Scheduler::~Scheduler()
{
}

/****************************************************************
 * dummy function for skeleton purposes
**/
void Scheduler::dummy()
{
  cout << "whatever\n";
}
